منابع مشابه
Job Shop Scheduling by Local Search
We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their eeectiveness and eeciency on a standard set of problem instances. In the job shop scheduling problem we are gi...
متن کاملCombining Constraint Programming and Local Search for Job-Shop Scheduling
Since their introduction, local search algorithms have consistently represented the state-ofthe-art in solution techniques for the classical job-shop scheduling problem. This is despite the availability of powerful search and inference techniques for scheduling problems developed by the constraint programming community. In this paper, we introduce a simple hybrid algorithm for job-shop scheduli...
متن کاملImproved Local Search for Job Shop Scheduling with uncertain Durations
This paper is concerned with local search methods to solve job shop scheduling problems with uncertain durations modelled as fuzzy numbers. Based on a neighbourhood structure from the literature, a reduced set of moves and the consequent structure are defined. Theoretical results show that the proposed neighbourhood contains all the improving solutions from the original neighbourhood and provid...
متن کاملGenetic Local Search for Job Shop Scheduling Problem
The Job Shop Scheduling Problem is a strongly NP-hard problem of combinatorial optimisation and one of the best-known machine scheduling problem. Taboo Search is an effective local search algorithm for the job shop scheduling problem, but the quality of the best solution found depends on the initial solution. To overcome this problem we present a new approach that uses a population of Taboo Sea...
متن کاملFast Local Search for Fuzzy Job Shop Scheduling
In the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem. This is a variant of the well-known job shop problem, with uncertainty in task durations modelled using fuzzy numbers and where the goal is to minimise the expected makespan of the resulting schedule. The new neighbourhood structure is based in changing the relative order of subse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 1996
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.8.3.302